Typical primitive polynomials over integer residue rings
نویسندگان
چکیده
منابع مشابه
Structured LDPC Codes over Integer Residue Rings
This paper presents a new class of low-density parity-check (LDPC) codes over Z2a represented by regular, structured Tanner graphs. These graphs are constructed using Latin squares defined over a multiplicative group of a Galois ring, rather than a finite field. Our approach yields codes for a wide range of code rates and more importantly, codes whose minimum pseudocodeword weights equal their ...
متن کاملInteger-valued Polynomials over Quaternion Rings
When D is an integral domain with field of fractions K, the ring Int(D) = {f(x) ∈ K[x] | f(D) ⊆ D} of integer-valued polynomials over D has been extensively studied. We will extend the integer-valued polynomial construction to certain noncommutative rings. Specifically, let i, j, and k be the standard quaternion units satisfying the relations i = j = −1 and ij = k = −ji, and define ZQ := {a+bi+...
متن کاملPermutation polynomials and their differential properties over residue class rings
This paper mainly focuses on permutation polynomials over the residue class ring ZN , where N > 3 is composite. We have proved that for the polynomial f(x) = a1x 1 + · · · + akx with integral coefficients, f(x) mod N permutes ZN if and only if f(x) mod N permutes Sμ for all μ | N , where Sμ = {0 < t < N : gcd(N, t) = μ} and SN = S0 = {0}. Based on it, we give a lower bound of the differential u...
متن کاملOn Inverses for Quadratic Permutation Polynomials over Integer Rings
Quadratic permutation polynomial interleavers over integer rings have recently received attention in practical turbo coding systems from deep space applications to mobile communications. In this correspondence, a necessary and sufficient condition that determines the least degree inverse of a quadratic permutation polynomial is proven. Moreover, an algorithm is provided to explicitly compute th...
متن کاملLDPC Convolutional Codes Based on Permutation Polynomials over Integer Rings
A novel algebraic construction technique for LDPC convolutional codes (LDPCCCs) based on permutation polynomials over integer rings is presented. The underlying elements of this construction technique are graph automorphisms and quasi-cyclic (QC) codes. The algebraic structure of the obtained LDPCCCs, their encoding and decoding are discussed. These new codes have a special structure, which is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2009
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2009.08.003